Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
291	Distributed Computing over Communication Networks: Locality Lower Bounds Stefan Schmid @ T-Labs, 2011 Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:49 Graph coloring NP-complete problems Graph theory Algorithm Distributed computing Time complexity Edge coloring Theoretical computer science Mathematics Applied mathematics
292	´ Quebec, ´ CCCG 2008, Montreal, August 13–15, 2008 Computational Balloon Twisting: Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:01:20 Eulerian path Route inspection problem Graph Matching Line graph Hamiltonian path Graph theory Planar graphs NP-complete problems
293	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:49 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory
294	16th Canadian Conference on Computational Geometry, 2004 Approximating optimal paths in terrains with weight defined by a piecewise-linear function J. A. P´erez Ruy-D´ıaz Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Curves NP-complete problems Network theory Routing algorithms Steiner tree problem Shortest path problem A* search algorithm Catenary Graph Graph theory Mathematics Theoretical computer science
295	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Network Design Subject to Facility Location J. Bhadury∗, R. Chandrasekaran†, L. Gewali‡ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:36 NP-complete problems Spanning tree Network theory Minimum spanning tree Shortest path problem Vertex cover Tree Steiner tree problem Widest path problem Graph theory Theoretical computer science Mathematics
296	The Euclidean k-Supplier Problem Viswanath Nagarajan1 , Baruch Schieber1 , and Hadas Shachnai2? 1 IBM T.J. Watson Research Center, Yorktown Heights, NYComputer Science Department, Technion, Haifa 32000, Israel Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-10-26 12:29:22 NP-complete problems Analysis of algorithms Combinatorial optimization Matching Spanning tree Planar graph Nearest neighbor search Connectivity Randomized algorithm Graph theory Theoretical computer science Mathematics
297	ICS 161 — Algorithms — Winter 1998 — Final Exam Name: ID: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 1998-11-13 18:59:50 NP-complete problems Mathematical optimization Analysis of algorithms Time complexity NP-complete Spreadsheet Approximation algorithm Algorithm Directed acyclic graph Theoretical computer science Applied mathematics Computational complexity theory
298	Mini-Indexes for Literate Programs Donald E. Knuth Computer Science Department, Stanford University, Stanford, CAUSA Abstract. This paper describes how to implement a documentation technique that helps reader Add to Reading List Source URL: www.literateprogramming.com Language: English - Date: 2007-10-09 02:22:30 Literate programming Graph theory NP-complete problems CWEB TeX Graph Extensible Storage Engine Permanent Vertex Mathematics Software Computing
299	Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 0, no. 0, pp. 0–0 (0) Inapproximability of Orthogonal Compaction Michael J. Bannister David Eppstein Joseph A. Simons Computer Science Department, Add to Reading List Source URL: jgaa.info Language: English - Date: 2012-03-09 04:02:51 NP-complete problems Graph coloring Topological graph theory Angular resolution Eulerian path Planar graph Graph Edge coloring Petersen graph Graph theory Mathematics Graph drawing
300	Computational Experience with Hypergraph-based Methods for Automatic Decomposition in Discrete Optimization Jiadong Wang and Ted Ralphs Department of Industrial and Systems Engineering, Lehigh University, USA Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2012-12-26 15:36:44 Applied mathematics NP-complete problems Hypergraph Mathematical optimization Decomposition method Graph partition Dantzig–Wolfe decomposition Linear programming Block matrix Mathematics Theoretical computer science Operations research

UPDATE